Globally-optimal prediction-based adaptive mutation particle swarm optimization
نویسندگان
چکیده
منابع مشابه
S3PSO: Students’ Performance Prediction Based on Particle Swarm Optimization
Nowadays, new methods are required to take advantage of the rich and extensive gold mine of data given the vast content of data particularly created by educational systems. Data mining algorithms have been used in educational systems especially e-learning systems due to the broad usage of these systems. Providing a model to predict final student results in educational course is a reason for usi...
متن کاملParticle Swarm Optimization: Efficient Globally Convergent Modifications
In this paper we consider the Particle Swarm Optimization (PSO) algorithm [10, 7], in the class of Evolutionary Algorithms, for the solution of global optimization problems. We analyze a couple of issues aiming at improving both the effectiveness and the efficiency of PSO. In particular, first we recognize that in accordance with the results in [5, 6], the initial points configuration required ...
متن کاملRELIABILITY-BASED DESIGN OPTIMIZATION OF COMPLEX FUNCTIONS USING SELF-ADAPTIVE PARTICLE SWARM OPTIMIZATION METHOD
A Reliability-Based Design Optimization (RBDO) framework is presented that accounts for stochastic variations in structural parameters and operating conditions. The reliability index calculation is itself an iterative process, potentially employing an optimization technique to find the shortest distance from the origin to the limit-state boundary in a standard normal space. Monte Carlo simulati...
متن کاملAn Adaptive Mutation Operator for Particle Swarm Optimization
Particle swarm optimization (PSO) is an efficient tool for optimization and search problems. However, it is easy to be trapped into local optima due to its information sharing mechanism. Many research works have shown that mutation operators can help PSO prevent premature convergence. In this paper, several mutation operators that are based on the global best particle are investigated and compa...
متن کاملA Dynamically Quantum Particle Swarm Optimization Algorithm with Adaptive Mutation
An Dynamically Quantum Particle Swarm Optimization Algorithm with Adaptive Mutation (AMDQPSO) is given, the algorithm can better adapt to the problem of the complex nonlinear optimization search. The concept of the evolution speed factor and aggregation degree factor are introduced to this algorithm, and the inertia weight was constructed as a function of the evolution speed factor and aggregat...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information Sciences
سال: 2017
ISSN: 0020-0255
DOI: 10.1016/j.ins.2017.07.038